An adaptive large neighborhood search heuristic for the Electric Vehicle Scheduling Problem
نویسندگان
چکیده
منابع مشابه
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
The Cumulative Capacitated Vehicle Routing Problem (CCVRP) is a variation of the classical Capacitated Vehicle Routing Problem in which the objective is the minimization of the sum of arrival times at customers, instead of the total routing cost. This paper presents an adaptive large neighborhood search heuristic for the CCVRP. This algorithm is applied to a set of benchmark instances and compa...
متن کاملAn Adaptive Large Neighborhood Search Heuristic for a Multi-Period Vehicle Routing Problem
We consider tactical planning for a particular class of multi-period vehicle routing problems (MPVRP). This problem involves optimizing product collection and distribution from several production locations to a set of processing plants over a planning horizon. Each horizon consists of several days, and the collection-distribution are performed on a repeating daily basis. In this context, a sing...
متن کاملAn adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics
In this paper, we propose an adaptive large neighborhood search heuristic for the Two-Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP). The 2E-VRP arises in two-level transportation systems such as those encountered in the context of city logistics. In such systems, freight arrives at a major terminal and is shipped through intermediate satellite facilities to the...
متن کاملAn Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows
The pickup and delivery problem with time windows is the problem of serving a number of transportation requests using a limited amount of vehicles. Each request involves moving a number of goods from a pickup location to a delivery location. Our task is to construct routes that visit all locations such that corresponding pickups and deliveries are placed on the same route and such that a pickup...
متن کاملAn adaptive large neighborhood search heuristic for the share-a-ride problem
The Share-a-Ride Problem (SARP) aims at maximizing the profit of serving a set of passengers and parcels using a set of homogeneous vehicles. We propose an adaptive large neighborhood search (ALNS) heuristic to address the SARP. Furthermore, we study the problem of determining the time slack in a SARP schedule. Our proposed solution approach is tested on three sets of realistic instances. The p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2016
ISSN: 0305-0548
DOI: 10.1016/j.cor.2016.06.013